Distributed generalized Nash equilibrium seeking for noncooperative games with unknown cost functions
نویسندگان
چکیده
In this article, a distributed nonmodel based generalized Nash equilibrium (GNE) seeking algorithm is proposed for class of constrained noncooperative games with unknown cost functions. the game, strategy each agent restricted by both coupled equality constraint and local inequality constraints. By virtue exact penalty method, an auxiliary function constructed The main feature depends on capability to estimate gradient information functions only values costs. This obtained extremum control (ESC). To deal constraints, Lagrange multiplier transmitted among agents some prior about Moreover, diminishing dither signal introduced in remove undesirable steady-state oscillations occurred classical ESC. As result, nonlocal convergence designed GNE game singular perturbation theory, averaging analysis Lyapunov stability theory. Numerical examples are given verify effectiveness our method.
منابع مشابه
A Distributed Nash Equilibrium Seeking in Networked Graphical Games
This paper considers a distributed gossip approach for finding a Nash equilibrium in networked games on graphs. In such games a player’s cost function may be affected by the actions of any subset of players. An interference graph is employed to illustrate the partially-coupled cost functions and the asymmetric information requirements. For a given interference graph, network communication betwe...
متن کاملStochastic Nash Equilibrium Seeking for Games with General Nonlinear Payoffs
We introduce a multi-input stochastic extremum seeking algorithm to solve the problem of seeking Nash equilibria for a noncooperative game whose N players seek to maximize their individual payoff functions. The payoff functions are general (not necessarily quadratic), and their forms are not known to the players. Our algorithm is a nonmodel-based approach for asymptotic attainment of the Nash e...
متن کاملA Douglas-Rachford splitting for semi-decentralized generalized Nash equilibrium seeking in Monotone Aggregative Games
We address the generalized Nash equilibrium seeking problem for noncooperative agents playing non-strictly monotone aggregative games with affine coupling constraints. First, we use operator theory to characterize the generalized Nash equilibria of the game as the zeros of a monotone setvalued operator. Then, we massage the Douglas–Rachford splitting to solve the monotone inclusion problem and ...
متن کاملNash equilibrium and generalized integration for infinite normal form games
Infinite normal form games that are mathematically simple have been treated [ Harris, C.J., Stinchcombe, M.B., Zame, W.R., in press. Nearly compact and continuous normal form games: characterizations and equilibrium existence. Games Econ. Behav.]. Under study in this paper are the other infinite normal form games, a class that includes the normal forms of most extensive form games with infinite...
متن کاملAn Approach to Fuzzy Noncooperative Nash Games
Systems that involve more than one decision maker are often optimized using the theory of games. In the traditional game theory, it is assumed that each player has a well-defined quantitative utility function over a set of the player decision space. Each player attempts to maximize minimize his her own expected utility and each is assumed to know the extensive game in full. At present, it canno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Robust and Nonlinear Control
سال: 2022
ISSN: ['1049-8923', '1099-1239']
DOI: https://doi.org/10.1002/rnc.6314